Multiple criteria minimum spanning trees
نویسندگان
چکیده
The NP multiple criteria minimum spanning tree as several applications into the network design problems. In this paper, we first introduce some properties than can help to characterize the problem, as well as to produce heuristics to solve it in a more efficient way. In the second part, we propose an application of the Multiple Objective Network optimization based on the Ant Colony Optimization (MONACO) algorithm to find out an approximation to the set of the nondominated solutions of the problem. The MONACO algorithm uses as many pheromone trails as the number of criteria and some local operators to increase the speed of the process and the quality of the results.
منابع مشابه
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
The building cost of a spanning tree is the sum of weights of the edges used to construct the spanning tree. The routing cost of a source vertex s on a spanning tree T is the total summation of distances between the source vertex s and all the vertices d in T . Given a source vertices set S, the multiple-source routing cost of a spanning tree T is the summation of the routing costs for source v...
متن کاملGeometric Minimum Diameter Minimum Cost Spanning Tree Problem
In this paper we consider bi-criteria geometric optimization problems, in particular, the minimum diameter minimum cost spanning tree problem and the minimum radius minimum cost spanning tree problem for a set of points in the plane. The former problem is to construct a minimum diameter spanning tree among all possible minimum cost spanning trees, while the latter is to construct a minimum radi...
متن کاملAn Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees
We propose a parallel graph-based data clustering algorithm using CUDA GPU, based on exact clustering of the minimum spanning tree in terms of a minimum isoperimetric criteria. We also provide a comparative performance analysis of our algorithm with other related ones which demonstrates the general superiority of this parallel algorithm over other competing algorithms in terms of accuracy and s...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملRepresenting all Minimum Spanning Trees with Applications to Counting and Generation
We show that for any edge-weighted graph G there is an equivalent graph EG such that the minimum spanning trees of G correspond one-for-one with the spanning trees of EG. The equivalent graph can be constructed in time O(m + n log n) given a single minimum spanning tree of G. As a consequence we can count the minimum spanning trees of G in time O(m+ n), generate a random minimum spanning tree i...
متن کامل